TGV: theory, principles and algorithms A tool for the automatic synthesis of conformance test cases for non-deterministic reactive systems

نویسندگان

  • Claude Jard
  • Thierry Jéron
چکیده

This paper presents the TGV tool allowing the automatic synthesis of conformance test cases from a formal specification of a (non-deterministic) reactive system. TGV has been developed by Irisa Rennes and Verimag Grenoble, with the support of the Vasy team of Inria Rhônes-Alpes. The paper describes the main elements of the underlying testing theory, based on a model of transitions system which distinguishes inputs, outputs and internal actions, and based on the concept of conformance relation. The principles of the test synthesis process are explained, as well as the main algorithms. We then describe the main characteristics of the TGV tool, and give some pointers to industrial experiments that have been conducted to validate the approach. As a conclusion, we describe some on going work on test synthesis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Principles of Distributed Test Synthesis based on True-concurrency Models

Automatic synthesis of test cases for conformance testing has been principally developed with the objective of generating sequential test cases. In the distributed system context, it is worth extending the synthesis techniques to the generation of multiple testers. We base our work on our experience in using model-checking techniques, as successfully implemented in the TGV tool. Continuing the ...

متن کامل

Synthesis of distributed testers from true-concurrency models of reactive systems

Automatic synthesis of test cases for conformance testing has been principally developed with the objective of generating sequential test cases. In the distributed system context, it is worth extending the synthesis techniques to the generation of multiple testers. We base our work on our experience in using modelchecking techniques, as successfully implemented in the TGV tool. Continuing the w...

متن کامل

A reactive bone route algorithm for solving the traveling salesman problem

The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...

متن کامل

Conformance Testing based on UML State Machines: Automated Test Case Generation, Execution and Evaluation

In this paper we describe a comprehensive approach for conformance testing of embedded reactive systems. Based on a formal specification, namely UML state machines, we automatically generate test cases and use them to check the functional conformance of a system under test. Our test cases include not only stimuli to trigger the system under test, they also include possible correct observations ...

متن کامل

Test Case Generation from UML State Machines∗

In this paper we describe a comprehensive approach for conformance testing of embedded reactive systems. Based on a formal specification, namely UML state machines, we automatically generate test cases and use them to check the functional conformance of a system under test. Our test cases include not only stimuli to trigger the system under test, they also include possible correct observations ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004